NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
541	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory
542	Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§ Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2009-10-29 15:21:24 NP-complete problems Vertex cover Feedback vertex set Independent set Matching Maximal independent set Parameterized complexity Algorithm Dominating set Theoretical computer science Mathematics Computational complexity theory
543	16th Canadian Conference on Computational Geometry, 2004 On Sequential Triangulations of Simple Polygons Robin Flatland Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 NP-complete problems Hamiltonian path Vertex Triangle strip Degree Graph theory Mathematics Theoretical computer science
544	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals Alexander Idelberger∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-27 21:29:04 Auxiliary function NP-complete problems Mathematics Forcing 8J
545	IEEE International Conference on Data Engineering Progressive Keyword Search in Relational Databases Guoliang Li† † Add to Reading List Source URL: dbgroup.cs.tsinghua.edu.cn Language: English - Date: 2012-01-09 09:42:51 Spanning tree NP-complete problems Network theory Steiner tree problem Minimum spanning tree Connectivity Tree Graph Shortest path problem Graph theory Theoretical computer science Mathematics
546	CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:18 NP-complete problems Graph coloring Domatic number Dominating set Independent set Greedy coloring Topology Maximal independent set Graph Graph theory Theoretical computer science Mathematics
547	Journal of Machine Learning Research vol–23 Submitted 24 May 2012; Published 2012 Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2012-06-05 15:17:28 Algebraic graph theory NP-complete problems Graph partition Laplacian matrix Degree Random graph Laplace operator Adjacency matrix Tutte polynomial Mathematics Graph theory Mathematical analysis
548	νZ - Maximal Satisfaction with Z3 Nikolaj Bjørner1 and Anh-Dung Phan2∗ 1 2 Microsoft Research Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-10-16 19:21:04 Formal methods Constraint programming Electronic design automation Logic in computer science NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Linear programming Mathematical optimization Theoretical computer science Applied mathematics Mathematics
549	MAGICK Word-Doku MAGICK Word-Doku By Terry Stickels Add to Reading List Source URL: www.terrystickels.com Language: English - Date: 2011-02-16 00:19:52 Magick Terry Stickels NP-complete problems Mathematics Sudoku
550	CCCG 2011, Toronto ON, August 10–12, 2011 Approximating the Obstacle Number for a Graph Drawing Efficiently∗ Deniz Sarı¨oz† Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Hypergraph Combinatorics Vertex cover Graph Incidence matrix Planar graph Path decomposition Line graph Graph theory Mathematics NP-complete problems

UPDATE